this paper proposes an efficient algorithm based on memetic algorithm (ma) for a redundancy allocation problem without component mixing (rapcm) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. majority of the solution methods for the general rapcm assume that the type of a redundancy strategy for each subsystem is pre-determined and known a prior...

A Memetic Algorithm (MA) encompasses a class of approaches with proven practical success in variety of optimization problems aiming to make use of benefits of each individual approach. In this paper, we present a special designed Memetic Algorithm to solve the well-known Symmetric Traveling Salesman Problem (STSP).The main feature of the Memetic Algorithm is to use a local search combined with ...

Abstract— Memetic Algorithm has been proven to be successful to find the nearest optimum solution to hard combinatorial optimization problems. In this paper, Memetic algorithm is designed for One-dimension Multi-Objective Bin Packing Problem. Memetic Algorithm is a combination of power of Genetic algorithm with the powerful local search technique to focus on the population of local optima. In t...

This paper proposes an effective memetic Gravitational Search Algorithm (GSA) that utilizes Solis and Wets’ (SW) algorithm as local search. GSA has good exploration ability and SW helps to improve the exploitation ability of the memetic algorithm. Furthermore, a selection strategy is proposed to select suitable individuals for local refinement that is based on subtractive clustering. Proposed m...

This article develops a novel method based on the memetic algorithm for optimal feedback control design. The aircraft controllers are designed to produce desired handling qualities. The robust properties of the linear quadratic regulator are exploited to obtain the desired aircraft handling qualities with an output feedback constrained linear quadratic regulator subspace based on a cost functio...

Memetic Algorithms have been proven to be successful to find the nearest optimum solution to hard combinatorial optimization problems. In this paper, Memetic algorithm is designed for Asymmetric Traveling salesman problem (ATSP). Memetic Algorithm is a combination of power of Genetic algorithm with the powerful local search technique to focus on the population of local optima. Because of perfor...

This contribution presents a new memetic algorithm for continuous optimization problems, which is specially designed for applying intense local search methods. These local search methods make use of explicit strategy parameters to guide the search, and adapt these parameters with the purpose of producing more effective solutions. They may achieve accurate results, at the cost of requiring high ...